TMC tetrahedral types MOD 2k + 1 and their structure graphs
نویسنده
چکیده
In [3,4,5], we treated edge weighted tetrahedra with a zero-sum condition on their triangles as the vertices of a graph Gi,n whose adjacency is given by the sharing of pairs ofedge-weighted triangles. In the present paper, we consider the situation modulo an odd positive integer n, so that we deal with hnite graph G'^,o. However, we are interested in a subgraph Gi.n of G;.4 that sheds light on the structure of the totally multicolored tetrahedra of complete Cayley graphs of odd orders, for Gi.n has surprising structural properties in itself.
منابع مشابه
Cycle-pancyclism in tournaments III
Let T be a hamiltonian tournament with n vertices and a hamiltonian cycle of T. For a cycle C k of length k in T we denote I (C k) = jA() \ A(C k)j, the number of arcs that and C k have in common. Let f(n; k; T;) = maxfI (C k)jC k Tg and f(n; k) = minff(n; k; T;)jT is a hamiltonian tournament with n vertices, and a hamiltonian cycle of Tg. In a previous paper 3] we studied the case of n 2k ? 4 ...
متن کاملγ k ( n ) = max { n / ( 2 k + 1 ) , 1 } for Maximal Outerplanar Graphs with n mod ( 2 k + 1 ) ≤ 6 L iang
Let G = (V, E) be an undirected graph with a set V of nodes and a set E of edges, |V | = n. A node v is said to distance-k dominate a node w if w is reachable from v by a path consisting of at most k edges. A set D ⊆ V is said a distance-k dominating set if every node can be distance-k dominated by some v ∈ D. The size of a minimum distance-k dominating set, denoted by γk(G), is called the dist...
متن کاملOn the Structure of Middle-levels Graphs
Let 0 < k ∈ Z and let n = 2k + 1. A rooted binary tree T is presented whose nodes are the classes mod n of the weight-k n-tuples over F2. Lexical 1-factorizations of the middle-levels graphs Mk allow to present an equivalent form of T via nodes that are the classes mod n of the weight-(k + 1) n-tuples over F2. This in turn allows to present a quotient graph Rk of Mk via reverse complementation ...
متن کاملThe generalized connectivity of complete equipartition 3-partite graphs
Let G be a nontrivial connected graph of order n, and k an integer with 2 ≤ k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number ` of edge-disjoint trees T1, T2, . . . , T` in G such that V (Ti) ∩ V (Tj) = S for every pair of distinct integers i, j with 1 ≤ i, j ≤ `. Chartrand et al. generalized the concept of connectivity as follows: The kconnectivity of G, denoted by κk(G...
متن کاملA lexical tree for the middle-levels graphs
Let m = 2k + 1 > 1 be an odd integer and let Hm be the Hasse diagram of the Boolean lattice on the coordinate set Zm. A rooted binary tree T is proposed that has as its nodes the translation classes mod m of the weight-k vertices of all Hm, for 0 < k ∈ Z, with an alternative form of T whose nodes are the translation classes mod m of weight-(k + 1) vertices via complemented reversals of the form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 12 شماره
صفحات -
تاریخ انتشار 1996